On Two Problems Regarding the Hamiltonian Cycle Game
نویسندگان
چکیده
We consider the fair Hamiltonian cycle Maker-Breaker game, played on the edge set of the complete graph Kn on n vertices. It is known that Maker wins this game if n is sufficiently large. We are interested in the minimum number of moves needed for Maker in order to win the Hamiltonian cycle game, and in the smallest n for which Maker has a winning strategy for this game. We prove the following results: (1) If n is sufficiently large, then Maker can win the Hamiltonian cycle game within n + 1 moves. This bound is best possible and it settles a question of Hefetz, Krivelevich, Stojaković and Szabó; (2) If n ≥ 29, then Maker can win the Hamiltonian cycle game. This improves the previously best bound of 600 due to Papaioannou.
منابع مشابه
Layered Graph Traversals and Hamiltonian Path Problems - An Algebraic Approach
Using an algebra of paths we present abstract algebraic derivations for two problem classes concerning graphs, viz. layer oriented traversal and computing sets of Hamiltonian paths. In the rst case, we are even able to abstract to the very general setting of Kleene algebras. Applications include reachability and a shortest path problem as well as topological sorting, cycle detection and nding m...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملDilations, models, scattering and spectral problems of 1D discrete Hamiltonian systems
In this paper, the maximal dissipative extensions of a symmetric singular 1D discrete Hamiltonian operator with maximal deficiency indices (2,2) (in limit-circle cases at ±∞) and acting in the Hilbert space ℓ_{Ω}²(Z;C²) (Z:={0,±1,±2,...}) are considered. We consider two classes dissipative operators with separated boundary conditions both at -∞ and ∞. For each of these cases we establish a self...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 16 شماره
صفحات -
تاریخ انتشار 2009